منابع مشابه
Shortest Superstring
In the Shortest Superstring problem (SS) one has to find a shortest string s containing given strings s1, . . . , sn as substrings. The problem is NP-hard, so a natural question is that of its approximability. One natural approach to approximately solving SS is the following GREEDY heuristic: repeatedly merge two strings with the largest overlap until only a single string is left. This heuristi...
متن کاملTowards a DNA Solution to the Shortest Common Superstring Problem
This paper proposes a DNA algorithm for solving an NP-complete problem (The Shortest Common Super-string Problem) by manipulation of biomolecules, and presents partial results of the experiment that implements our algorithm. We also discuss practical constraints that have to be taken into account when implementing the algorithm, propose a coding system as a solution to these practical restricti...
متن کاملThe Shortest Common Superstring Problem
We consider the problem of the shortest common superstring. We describe an approach to solve the problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.
متن کاملLecture notes on Shortest Superstring Problem
So far we have studied the set covering problem, but not looked at any real life applications. The shortest superstring problem takes as input, several strings of different lengths and finds the shortest string that contains all the input strings as substrings. This is helpful in the genome project since it will allow researchers to determine entire coding regions from a collection of fragmente...
متن کاملApproximation hardness of Shortest Common Superstring variants
The shortest common superstring (SCS) problem has been studied at great length because of its connections to the de novo assembly problem in computational genomics. The base problem is APXcomplete, but several generalizations of the problem have also been studied. In particular, previous results include that SCS with Negative strings (SCSN) is in Log-APX (though there is no known hardness resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/15503-4093